Feasible Disjunction Property and Feasible Interpolation in Modal Logic

نویسنده

  • MARTA BÍLKOVÁ
چکیده

We prove Feasible Disjunction Property for modal propositional logics K, K4, K4Grz, GL, T, S4, and S4Grz, by a uniform and simple proof based on modular modal sequent proof systems. We derive Feasible Interpolation Theorem for all the logics. Our results are weaker than Hrubeš’ obtained in [9].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Disjunction Property and Finite Model Property For an Intuitionistic Epistemic Logic

We show finite model property, disjunction property and decidability for an intuitionistic epistemic logic IEC. Intuitionistic logic is originally a formalisation of a single mathematician whose knowledge increases over time. The logic IEC formalises multiple agents that communicate asynchronously and whose knowledge increases over time. Although soundness and strong completeness for IEC for a ...

متن کامل

Interrelation of Algebraic, Semantical and Logical Properties for Superintuitionistic and Modal Logics

We consider the families L of propositional superintuitionistic logics (s.i.l.) andNE(K) of normal modal logics (n.m.l.). It is well known that there is a duality between L and the lattice of varieties of pseudo-boolean algebras (or Heyting algebras), and also NE(K) is dually isomorphic to the lattice of varieties of modal algebras. Many important properties of logics, for instance, Craig’s int...

متن کامل

Interpolation and Beth Definability over the Minimal Logic

Extensions of the Johansson minimal logic J are investigated. It is proved that the weak interpolation property WIP is decidable over J. Well-composed logics with the Graig interpolation property CIP, restricted interpolation property IPR and projective Beth property PBP are fully described. It is proved that there are only finitely many well-composed logics with CIP, IPR or PBP; for any well-c...

متن کامل

The Craig Interpolation Theorem in Multi - Modal Logics

In [13] and [14] Maksimova proved that a normal modal logic (with one unary modality) has the Craig interpolation property iff the corresponding class of algebras has the superamalgamation property. (These notions will be recalled below.) In this paper we extend Maksimova’s theorem to normal multi-modal logics with arbitrarily many, not necessarily unary modalities, and to not necessarily norma...

متن کامل

A non-classical refinement of the interpolation property for classical propositional logic

We refine the interpolation property of the {∧,∨,¬}-fragment of classical propositional logic, showing that if 2 ¬φ, 2 ψ and φ ψ then there is an interpolant χ, constructed using at most atomic formulas occurring in both φ and ψ and negation, conjunction and disjunction, such that (i) φ entails χ in Kleene’s strong three-valued logic and (ii) χ entails ψ in Priest’s Logic of Paradox.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007